Probabilistic CTL*: The Deductive Way
نویسندگان
چکیده
Complex probabilistic temporal behaviours need to be guaranteed in robotics and various other control domains, as well as in the context of families of randomized protocols. At its core, this entails checking infinite-state probabilistic systems with respect to quantitative properties specified in probabilistic temporal logics. Model checking methods are not directly applicable to infinite-state systems, and techniques for infinite-state probabilistic systems are limited in terms of the specifications they can handle. This paper presents a deductive approach to the verification of countablestate systems against properties specified in probabilistic CTL∗, on models featuring both nondeterministic and probabilistic choices. The deductive proof system we propose lifts the classical proof system by Kesten and Pnueli to the probabilistic setting. However, the soundness arguments are completely distinct and go via the theory of martingales. Completeness results for the finite-state case and an infinite-state example illustrate the effectiveness of our approach.
منابع مشابه
Probabilistic Reasoning for Large Scale Databases
The complexity of probabilistic reasoning prohibits its application on a large scale of data. In order to reduce the complexity, implementations of modeling approaches restrict themselves with respect to expressive power or relax on the underlying probability theory. We present the implementation aspects of a probabilistic extension of stratified Datalog. This probabilistic deductive system is ...
متن کاملOn the Alleged Impossibility of Inductive Probability*
Karl Popper and David Miller [1983] have argued that there is no such thing as probabilistic inductive support, as conceived of, for example, in the Bayesian theory of evidence. A little more specifically, they argue that 'all probabilistic support is purely deductive' (p. 688), and that only probabilistic countersupport (disconfirmation) could be inductive in nature. Their interesting and stri...
متن کاملIs inferential reasoning just probabilistic reasoning in disguise?
Oaksford, Chater, and Larkin (2000) have suggested that people actually use everyday probabilistic reasoning when making deductive inferences. In two studies, we explicitly compared probabilistic and deductive reasoning with identical if-then conditional premises with concrete content. In the first, adults were given causal premises with one strongly associated antecedent and were asked to make...
متن کاملDiscrete-Time Rewards Model-Checked
This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with reward constraints. This allows to formulate complex measures – involving expected as well as accumulated rewards – in a precise and succinct way. Algorithms to efficiently analyze such formulae are introduced. The approach is il...
متن کاملProbabilistic diagnosis as an update problem
Incompleteness is addressed by using a framework that allows expression of probability. An update procedure is given to handle nonmonotonic change of knowledge. We point out the relationship between probabilistic diagnosis and probabilistic deductive database updates, and present a coincidence theorem which formally establishes it. An implication of the result allows us to treat diagnostic prob...
متن کامل